bit string造句
例句與造句
- This specifies a key as a 13 - character 104 - bit string
它將密鑰指定為13個字符（ 104位）的字符串。 - Are best described as a condensed summary of a bit string
的最好描述是：它是對比特串的壓縮表示。 - A character string or a bit string considered as an entity
作為一個實體的一組字符串或一組字位串。 - Condensing bit strings and other data
壓縮比特串和其他數(shù)據(jù) - A bit string array - based mining algorithm for maximum frequent itemset
基于位串?dāng)?shù)組的最大頻繁項目集挖掘算法 - It's difficult to find bit string in a sentence. 用bit string造句挺難的
- Bit string operators
位元串運算元 - Bit string operator
位串操作符 - Bit string data
位串?dāng)?shù)據(jù) - Data is compressed by replacing frequently occurring bit strings with shorter strings
通過用較短的字符串替換經(jīng)常出現(xiàn)的長字符串，可以壓縮數(shù)據(jù)。 - If the run begins with a 1 , we start the list with the number 0 , meaning the 1s start the bit string
如果開始出現(xiàn)的是1 ，我們以數(shù)字0來開始這個序列，表示這個比特串以1開始。 - A dictionary is built that contains information mapping the original bit strings and their replacements
這時會建立一個字典，其中包含了映射原始的長字符串與它們的替換值的信息。 - Suppose you want to encode the bit string " 1110011 . " an inversion list would store a list of three numbers : 0 , 3 , 5
假設(shè)您要對一個比特串“ 1110011 ”進行編碼。倒排表將存儲一個由三個數(shù)字構(gòu)成的序列： 0 ， 3 ， 5 。 - All we store is the start position of the 1s , then the start position of the 0s , then the position of 1s again , and so on until the bit string is over
我們存儲的是，開始出現(xiàn)1的位置，開始出現(xiàn)0的位置，然后再是出現(xiàn)1的位置，如此重復(fù)直到比特串結(jié)束。 - Suppose you want to complement the three middle bits of a seven - bit string while leaving the other four bits undisturbed . what mask must you use together with what operation
假設(shè)你要將一個7位元字串的中間三個位元取補數(shù),其他保留,你該用什麼樣的遮罩及運算 - 138 variable length coding ( vlc ) : a reversible procedure for entropy coding that assigns shorter bit strings to symbols expected to be more frequent and longer bit strings to symbols expected to be less frequent
可變長編碼vlc ：一種可逆熵編碼，為出現(xiàn)頻率高的符號分配少的位，為出現(xiàn)頻率低的符號更多的位。
更多例句： 下一頁